The Generalized Median Stable Matchings: finding them is not that easy Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA.

Source URL: www.cs.uwm.edu

• Mathematics
• Matching
• Combinatorics
• Cooperative games
• Game theory
• Combinatorial optimization
• Stable marriage problem
• Partially ordered set

The Test Suite Generation Problem: Optimal Instances and Their Implications Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA.

Source URL: www.cs.uwm.edu

• Set theory
• Mathematics
• Model theory
• Tree
• Base
• Philosophy of mathematics
• Large cardinals
• Abstraction

Paul Bracher Chem 30 – Section 5 Carbonyl Chemistry II: Stereoselective Additions Section Agenda 1) Problem Set #3 (due today) will be graded by Wednesday

Source URL: www.paulbracher.com

• Chemistry
• Organic chemistry
• Functional groups
• Ester
• Carboxylic acid
• Carbonyl group
• BrgiDunitz angle
• Nucleophilic addition
• Amide
• Ketone
• Tetrahedral carbonyl addition compound
• Asymmetric induction

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

Geodesic connectedness on G¨odel type spacetimes: a “static” variational set-up Rossella Bartolo September 6∼9, 2011 Email: We show that the problem of the geodesic connectedness of a wide clas

Source URL: gigda.ugr.es

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

Source URL: mmds-data.org

5. PROBLEM SET FOR “DIFFERENTIAL GEOMETRY II” AKA “ANALYSIS AND GEOMETRY ON MANIFOLDS” WINTER TERMProblem 13. Let M be a manifold, X, Y ∈ X(M ) and f, g ∈ C ∞ (M ). Prove that

Source URL: carsten.codimi.de

Introduction to Numerical Analysis Spring 2016 Problem Set 9 Solutions Problem 1. Consider the integral Z

Source URL: homerreid.dyndns.org

• Mathematical analysis
• Mathematics
• Numerical integration
• Orthogonal polynomials
• ClenshawCurtis quadrature
• Approximation theory
• Fourier analysis
• Exponentiation
• Chebyshev polynomials
• Bessel function

Written Examination, May 28th, 2014 Course noThe duration of the examination is 4 hours. Course Name: Fun tional programming Allowed aids: All written material The problem set onsists of 3 problems whi h are wei

Source URL: www.imm.dtu.dk

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Set cover problem
• Approximation algorithm
• Algorithm
• Analysis of algorithms
• Bin packing problem
• Vertex cover